Cardinal interpolation and spline fucntions V. The B-splines for cardinal Hermite interpolation

AbstractIn the third paper of this series on cardinal spline interpolation [4] Lipow and Schoenberg study the problem of Hermite interpolation S(v) = Yv, S′(v) = Yv′,…,S(r−1)(v) = Yv(r−1) for allv. The B-splines are there conspicuous by their absence, although they were found very useful for the case γ = 1 of ordinary (or Lagrange) interpolation (see [5–10]). The purpose of the present paper is to investigate the B-splines for the case of Hermite interpolation (γ > 1). In this sense the present paper is a supplement to [4] and is based on its results. This is done in Part I. Part II is devoted to the special case when we want to solve the problem S(v) = Yv, S′(v) = Yv′ for all v by quintic spline functions of the class C‴(– ∞, ∞). This is the simplest nontrivial example for the general theory. In Part II we derive an explicit solution for the problem (1), where v = 0, 1,…, n

A topological interpretation of the walk distances

The walk distances in graphs have no direct interpretation in terms of walk weights, since they are introduced via the \emph{logarithms} of walk weights. Only in the limiting cases where the logarithms vanish such representations follow straightforwardly. The interpretation proposed in this paper rests on the identity \ln\det B=\tr\ln B applied to the cofactors of the matrix $I-tA,$ where $A$ is the weighted adjacency matrix of a weighted multigraph and $t$ is a sufficiently small positive parameter. In addition, this interpretation is based on the power series expansion of the logarithm of a matrix. Kasteleyn (1967) was probably the first to apply the foregoing approach to expanding the determinant of $I-A$. We show that using a certain linear transformation the same approach can be extended to the cofactors of $I-tA,$ which provides a topological interpretation of the walk distances.Comment: 13 pages, 1 figure. Version #

On kernel engineering via Paley–Wiener

A radial basis function approximation takes the form $$s(x)=\sum_{k=1}^na_k\phi(x-b_k),\quad x\in {\mathbb{R}}^d,$$ where the coefficients a 1,…,a n are real numbers, the centres b 1,…,b n are distinct points in ℝ d , and the function φ:ℝ d →ℝ is radially symmetric. Such functions are highly useful in practice and enjoy many beautiful theoretical properties. In particular, much work has been devoted to the polyharmonic radial basis functions, for which φ is the fundamental solution of some iterate of the Laplacian. In this note, we consider the construction of a rotation-invariant signed (Borel) measure μ for which the convolution ψ=μ φ is a function of compact support, and when φ is polyharmonic. The novelty of this construction is its use of the Paley–Wiener theorem to identify compact support via analysis of the Fourier transform of the new kernel ψ, so providing a new form of kernel engineering

Euclidean Distances, soft and spectral Clustering on Weighted Graphs

We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the "raw coordinates" encountered in spectral clustering, and can be extended by means of higher-dimensional embeddings (Schoenberg transformations). Geographical flow data, properly conditioned, illustrate the procedure as well as visualization aspects.Comment: accepted for presentation (and further publication) at the ECML PKDD 2010 conferenc

A Generalization of the Convex Kakeya Problem

Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment? This question can be seen as a generalization of Kakeya's problem of finding a convex region of smallest area such that a needle can be rotated through 360 degrees within this region. We show that there is always an optimal region that is a triangle, and we give an optimal \Theta(n log n)-time algorithm to compute such a triangle for a given set of n segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then placing the segments with their midpoint at the origin and taking their convex hull results in an optimal solution. Finally, we show that for any compact convex figure G, the smallest enclosing disk of G is a smallest-perimeter region containing a translate of every rotated copy of G.Comment: 14 pages, 9 figure

Möbius characterization of hemispheres

In this paper we generalize the Möbius characterization of metric spheres as obtained in Foertsch and Schroeder [4] to a corresponding Möbius characterization of metric hemispheres

On spherical averages of radial basis functions

A radial basis function (RBF) has the general form $$s(x)=\sum_{k=1}^{n}a_{k}\phi(x-b_{k}),\quad x\in\mathbb{R}^{d},$$ where the coefficients a 1,…,a n are real numbers, the points, or centres, b 1,…,b n lie in ℝ d , and φ:ℝ d →ℝ is a radially symmetric function. Such approximants are highly useful and enjoy rich theoretical properties; see, for instance (Buhmann, Radial Basis Functions: Theory and Implementations, [2003]; Fasshauer, Meshfree Approximation Methods with Matlab, [2007]; Light and Cheney, A Course in Approximation Theory, [2000]; or Wendland, Scattered Data Approximation, [2004]). The important special case of polyharmonic splines results when φ is the fundamental solution of the iterated Laplacian operator, and this class includes the Euclidean norm φ(x)=‖x‖ when d is an odd positive integer, the thin plate spline φ(x)=‖x‖2log  ‖x‖ when d is an even positive integer, and univariate splines. Now B-splines generate a compactly supported basis for univariate spline spaces, but an analyticity argument implies that a nontrivial polyharmonic spline generated by (1.1) cannot be compactly supported when d>1. However, a pioneering paper of Jackson (Constr. Approx. 4:243–264, [1988]) established that the spherical average of a radial basis function generated by the Euclidean norm can be compactly supported when the centres and coefficients satisfy certain moment conditions; Jackson then used this compactly supported spherical average to construct approximate identities, with which he was then able to derive some of the earliest uniform convergence results for a class of radial basis functions. Our work extends this earlier analysis, but our technique is entirely novel, and applies to all polyharmonic splines. Furthermore, we observe that the technique provides yet another way to generate compactly supported, radially symmetric, positive definite functions. Specifically, we find that the spherical averaging operator commutes with the Fourier transform operator, and we are then able to identify Fourier transforms of compactly supported functions using the Paley–Wiener theorem. Furthermore, the use of Haar measure on compact Lie groups would not have occurred without frequent exposure to Iserles’s study of geometric integration

Metric trees of generalized roundness one

Every finite metric tree has generalized roundness strictly greater than one. On the other hand, some countable metric trees have generalized roundness precisely one. The purpose of this paper is to identify some large classes of countable metric trees that have generalized roundness precisely one. At the outset we consider spherically symmetric trees endowed with the usual combinatorial metric (SSTs). Using a simple geometric argument we show how to determine decent upper bounds on the generalized roundness of finite SSTs that depend only on the downward degree sequence of the tree in question. By considering limits it follows that if the downward degree sequence $(d_{0}, d_{1}, d_{2}...)$ of a SST $(T,\rho)$ satisfies $|\{j \, | \, d_{j} > 1 \}| = \aleph_{0}$, then $(T,\rho)$ has generalized roundness one. Included among the trees that satisfy this condition are all complete $n$-ary trees of depth $\infty$ ($n \geq 2$), all $k$-regular trees ($k \geq 3$) and inductive limits of Cantor trees. The remainder of the paper deals with two classes of countable metric trees of generalized roundness one whose members are not, in general, spherically symmetric. The first such class of trees are merely required to spread out at a sufficient rate (with a restriction on the number of leaves) and the second such class of trees resemble infinite combs.Comment: 14 pages, 2 figures, 2 table

Locked and Unlocked Chains of Planar Shapes

We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged together sequentially at rotatable joints. Our goal is to characterize the families of planar shapes that admit locked chains, where some configurations cannot be reached by continuous reconfiguration without self-intersection, and which families of planar shapes guarantee universal foldability, where every chain is guaranteed to have a connected configuration space. Previously, only obtuse triangles were known to admit locked shapes, and only line segments were known to guarantee universal foldability. We show that a surprisingly general family of planar shapes, called slender adornments, guarantees universal foldability: roughly, the distance from each edge along the path along the boundary of the slender adornment to each hinge should be monotone. In contrast, we show that isosceles triangles with any desired apex angle less than 90 degrees admit locked chains, which is precisely the threshold beyond which the inward-normal property no longer holds.Comment: 23 pages, 25 figures, Latex; full journal version with all proof details. (Fixed crash-induced bugs in the abstract.